Fully differential NNLO computations with MATRIX
نویسندگان
چکیده
منابع مشابه
The fully-differential quark beam function at NNLO
We present the first calculation of a fully-unintegrated parton distribution (beam function) at next-to-next-to-leading order (NNLO). We obtain the fully-differential beam function for quark-initiated processes by matching it onto standard parton distribution functions (PDFs) at two loops. The fully-differential beam function is a universal ingredient in resummed predictions of observables prob...
متن کاملNested soft-collinear subtractions in NNLO QCD computations
We discuss a modification of the next-to-next-to-leading order (NNLO) subtraction scheme based on the residue-improved sector decomposition that reduces the number of double-real emission sectors from five to four. In particular, a sector where energies and angles of unresolved particles vanish in a correlated fashion is redundant and can be discarded. This simple observation allows us to formu...
متن کاملRegularized Matrix Computations
We review the basic results on: (1) the singular value decomposition (SVD); (2) sensitivity and conditioning of solutions of linear systems of equations; (3) regularization; and (4) iterative solution of linear systems of equations. These are applied to the specific problem of computing a matrix null vector. I. SINGULAR VALUE DECOMPOSITION A. Basics The singular value decomposition (SVD) of any...
متن کاملParallel Matrix Computations
In this article we develop some algorithms and tools for solving matrix problems on parallel processing computers. Operations are synchronized through data-flow alone, which makes global synchronization unnecessary and enables the algorithms to be implemented on machines with very simple operating systems and communication protocols. As examples, zve present algorithms that form the main module...
متن کاملFast Matrix Polynomial Computations
Pour une matrice polynomiale P(x) de degr e d dans Mn;n(Kx]), o u K est un corps commutatif, une r eduction a la forme normale d'Hermite peut ^ etre calcul ee en O ~ (M(nd)) op erations arithm etiques, si M(n) est le co^ ut du produit de deux matrices n n sur K. De plus, une telle r eduction peut ^ etre obtenue en temps parall ele O(log +1 (nd)) en utilisant O(L(nd)) processeurs, si le probl em...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The European Physical Journal C
سال: 2018
ISSN: 1434-6044,1434-6052
DOI: 10.1140/epjc/s10052-018-5771-7